0.11/0.12 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.11/0.13 % Command : run_E %s %d THM 0.13/0.34 % Computer : n014.cluster.edu 0.13/0.34 % Model : x86_64 x86_64 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.13/0.34 % Memory : 8042.1875MB 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64 0.13/0.34 % CPULimit : 960 0.13/0.34 % WCLimit : 120 0.13/0.34 % DateTime : Tue Aug 9 04:02:31 EDT 2022 0.13/0.34 % CPUTime : 0.19/0.46 Running higher-order on 8 cores theorem proving 0.19/0.46 Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=120 /export/starexec/sandbox/benchmark/theBenchmark.p 0.19/0.46 # Version: 3.0pre003-ho 23.48/3.40 # Preprocessing class: HSSSSMSSSSSNHHA. 23.48/3.40 # Scheduled 5 strats onto 8 cores with 120 seconds (960 total) 23.48/3.40 # Starting sh2lt with 480s (4) cores 23.48/3.40 # Starting new_ho_10_unif with 120s (1) cores 23.48/3.40 # Starting full_lambda_6 with 120s (1) cores 23.48/3.40 # Starting post_as_ho1 with 120s (1) cores 23.48/3.40 # Starting ehoh_best3_rw with 120s (1) cores 23.48/3.40 # ehoh_best3_rw with pid 9554 completed with status 0 23.48/3.40 # Result found by ehoh_best3_rw 23.48/3.40 # Preprocessing class: HSSSSMSSSSSNHHA. 23.48/3.40 # Scheduled 5 strats onto 8 cores with 120 seconds (960 total) 23.48/3.40 # Starting sh2lt with 480s (4) cores 23.48/3.40 # Starting new_ho_10_unif with 120s (1) cores 23.48/3.40 # Starting full_lambda_6 with 120s (1) cores 23.48/3.40 # Starting post_as_ho1 with 120s (1) cores 23.48/3.40 # Starting ehoh_best3_rw with 120s (1) cores 23.48/3.40 # SinE strategy is gf120_gu_RUU_F100_L01000 23.48/3.40 # ...ProofStateSinE()=1/2 23.48/3.40 # Search class: HGHNF-FFSF22-SHHFFSBN 23.48/3.40 # Scheduled 6 strats onto 1 cores with 120 seconds (120 total) 23.48/3.40 # Starting new_ho_10_unif with 36s (1) cores 23.48/3.40 # new_ho_10_unif with pid 9562 completed with status 0 23.48/3.40 # Result found by new_ho_10_unif 23.48/3.40 # Preprocessing class: HSSSSMSSSSSNHHA. 23.48/3.40 # Scheduled 5 strats onto 8 cores with 120 seconds (960 total) 23.48/3.40 # Starting sh2lt with 480s (4) cores 23.48/3.40 # Starting new_ho_10_unif with 120s (1) cores 23.48/3.40 # Starting full_lambda_6 with 120s (1) cores 23.48/3.40 # Starting post_as_ho1 with 120s (1) cores 23.48/3.40 # Starting ehoh_best3_rw with 120s (1) cores 23.48/3.40 # SinE strategy is gf120_gu_RUU_F100_L01000 23.48/3.40 # ...ProofStateSinE()=1/2 23.48/3.40 # Search class: HGHNF-FFSF22-SHHFFSBN 23.48/3.40 # Scheduled 6 strats onto 1 cores with 120 seconds (120 total) 23.48/3.40 # Starting new_ho_10_unif with 36s (1) cores 23.48/3.40 # Preprocessing time : 0.001 s 23.48/3.40 # Presaturation interreduction done 23.48/3.40 23.48/3.40 # Proof found! 23.48/3.40 # SZS status Theorem 23.48/3.40 # SZS output start CNFRefutation 23.48/3.40 thf(decl_22, type, epred1_0: a > a > $o). 23.48/3.40 thf(decl_23, type, esk1_0: (a > $o) > a). 23.48/3.40 thf(decl_24, type, esk2_2: (a > $o) > a > a). 23.48/3.40 thf(decl_25, type, esk3_0: a > a). 23.48/3.40 thf(cTHM145L_pme, conjecture, ![X1:a > a > $o, X2:(a > $o) > a]:((![X3:a > a]:((?[X4:a]:(((X1 @ (X3 @ X4) @ X4)&(X1 @ X4 @ (X3 @ X4))))<=![X5:a, X6:a]:(((X1 @ X5 @ X6)=>(X1 @ (X3 @ X5) @ (X3 @ X6))))))<=(![X7:a > $o]:((![X8:a]:(((X1 @ X8 @ (X2 @ X7))<=(X7 @ X8)))&![X9:a]:(((X1 @ (X2 @ X7) @ X9)<=![X10:a]:(((X7 @ X10)=>(X1 @ X10 @ X9)))))))&![X5:a, X6:a, X8:a]:((((X1 @ X6 @ X8)&(X1 @ X5 @ X6))=>(X1 @ X5 @ X8)))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', cTHM145L_pme)). 23.48/3.40 thf(c_0_1, negated_conjecture, ~(![X1:a > a > $o, X2:(a > $o) > a]:(((![X7:a > $o]:((![X8:a]:(((X7 @ X8)=>(X1 @ X8 @ (X2 @ X7))))&![X9:a]:((![X10:a]:(((X7 @ X10)=>(X1 @ X10 @ X9)))=>(X1 @ (X2 @ X7) @ X9)))))&![X5:a, X6:a, X8:a]:((((X1 @ X6 @ X8)&(X1 @ X5 @ X6))=>(X1 @ X5 @ X8))))=>![X3:a > a]:((![X5:a, X6:a]:(((X1 @ X5 @ X6)=>(X1 @ (X3 @ X5) @ (X3 @ X6))))=>?[X4:a]:(((X1 @ (X3 @ X4) @ X4)&(X1 @ X4 @ (X3 @ X4))))))))), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[cTHM145L_pme])])). 23.48/3.40 thf(c_0_2, negated_conjecture, ![X26:a > $o, X27:a, X28:a, X30:a, X31:a, X32:a, X34:a, X35:a, X36:a]:(((((~(X26 @ X27)|(epred1_0 @ X27 @ (esk1_0 @ X26)))&(((X26 @ (esk2_2 @ X26 @ X28))|(epred1_0 @ (esk1_0 @ X26) @ X28))&(~(epred1_0 @ (esk2_2 @ X26 @ X28) @ X28)|(epred1_0 @ (esk1_0 @ X26) @ X28))))&(~(epred1_0 @ X31 @ X32)|~(epred1_0 @ X30 @ X31)|(epred1_0 @ X30 @ X32)))&((~(epred1_0 @ X34 @ X35)|(epred1_0 @ (esk3_0 @ X34) @ (esk3_0 @ X35)))&(~(epred1_0 @ (esk3_0 @ X36) @ X36)|~(epred1_0 @ X36 @ (esk3_0 @ X36)))))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])])])). 23.48/3.40 thf(c_0_3, negated_conjecture, ![X6:a, X5:a, X4:a]:(((epred1_0 @ X6 @ X5)|~((epred1_0 @ X4 @ X5))|~((epred1_0 @ X6 @ X4)))), inference(split_conjunct,[status(thm)],[c_0_2])). 23.48/3.40 thf(c_0_4, negated_conjecture, ![X7:a > $o, X4:a]:(((X7 @ (esk2_2 @ X7 @ X4))|(epred1_0 @ (esk1_0 @ X7) @ X4))), inference(split_conjunct,[status(thm)],[c_0_2])). 23.48/3.40 thf(c_0_5, negated_conjecture, ![X3:a > a, X4:a, X13:a > a, X5:a]:(((epred1_0 @ (X3 @ (esk2_2 @ (^[Z0:a]:((epred1_0 @ (X3 @ Z0) @ (X13 @ Z0)))) @ X4)) @ X5)|(epred1_0 @ (esk1_0 @ (^[Z0:a]:((epred1_0 @ (X3 @ Z0) @ (X13 @ Z0))))) @ X4)|~((epred1_0 @ (X13 @ (esk2_2 @ (^[Z0:a]:((epred1_0 @ (X3 @ Z0) @ (X13 @ Z0)))) @ X4)) @ X5)))), inference(spm,[status(thm)],[c_0_3, c_0_4])). 23.48/3.40 thf(c_0_6, negated_conjecture, ![X4:a, X5:a]:(((epred1_0 @ (esk3_0 @ X4) @ (esk3_0 @ X5))|~((epred1_0 @ X4 @ X5)))), inference(split_conjunct,[status(thm)],[c_0_2])). 23.48/3.40 thf(c_0_7, negated_conjecture, ![X7:a > $o, X4:a]:(((epred1_0 @ X4 @ (esk1_0 @ X7))|~((X7 @ X4)))), inference(split_conjunct,[status(thm)],[c_0_2])). 23.48/3.40 thf(c_0_8, negated_conjecture, ![X3:a > a, X4:a, X13:a > a, X5:a]:(((epred1_0 @ (X3 @ (esk2_2 @ (^[Z0:a]:((epred1_0 @ (X3 @ Z0) @ (esk3_0 @ (X13 @ Z0))))) @ X4)) @ (esk3_0 @ X5))|(epred1_0 @ (esk1_0 @ (^[Z0:a]:((epred1_0 @ (X3 @ Z0) @ (esk3_0 @ (X13 @ Z0)))))) @ X4)|~((epred1_0 @ (X13 @ (esk2_2 @ (^[Z0:a]:((epred1_0 @ (X3 @ Z0) @ (esk3_0 @ (X13 @ Z0))))) @ X4)) @ X5)))), inference(spm,[status(thm)],[c_0_5, c_0_6])). 23.48/3.40 thf(c_0_9, negated_conjecture, ![X1:a > a > $o, X4:a]:(((epred1_0 @ (esk2_2 @ (^[Z0:a]:((X1 @ Z0 @ Z0))) @ X4) @ (esk1_0 @ (^[Z0:a]:((X1 @ Z0 @ Z0)))))|(epred1_0 @ (esk1_0 @ (^[Z0:a]:((X1 @ Z0 @ Z0)))) @ X4))), inference(spm,[status(thm)],[c_0_7, c_0_4])). 23.48/3.40 thf(c_0_10, negated_conjecture, ![X7:a > $o, X4:a]:(((epred1_0 @ (esk1_0 @ X7) @ X4)|~((epred1_0 @ (esk2_2 @ X7 @ X4) @ X4)))), inference(split_conjunct,[status(thm)],[c_0_2])). 23.48/3.40 thf(c_0_11, negated_conjecture, ![X4:a]:(((epred1_0 @ (esk2_2 @ (^[Z0:a]:((epred1_0 @ Z0 @ (esk3_0 @ Z0)))) @ X4) @ (esk3_0 @ (esk1_0 @ (^[Z0:a]:((epred1_0 @ Z0 @ (esk3_0 @ Z0)))))))|(epred1_0 @ (esk1_0 @ (^[Z0:a]:((epred1_0 @ Z0 @ (esk3_0 @ Z0))))) @ X4))), inference(spm,[status(thm)],[c_0_8, c_0_9])). 23.48/3.40 thf(c_0_12, negated_conjecture, ![X3:a > a, X4:a]:(((epred1_0 @ (esk3_0 @ X4) @ (esk1_0 @ (^[Z0:a]:((epred1_0 @ Z0 @ (esk3_0 @ (X3 @ Z0)))))))|~((epred1_0 @ X4 @ (X3 @ (esk3_0 @ X4)))))), inference(spm,[status(thm)],[c_0_7, c_0_6])). 23.48/3.40 thf(c_0_13, negated_conjecture, (epred1_0 @ (esk1_0 @ (^[Z0:a]:((epred1_0 @ Z0 @ (esk3_0 @ Z0))))) @ (esk3_0 @ (esk1_0 @ (^[Z0:a]:((epred1_0 @ Z0 @ (esk3_0 @ Z0))))))), inference(spm,[status(thm)],[c_0_10, c_0_11])). 23.48/3.40 thf(c_0_14, negated_conjecture, ![X4:a]:((~((epred1_0 @ (esk3_0 @ X4) @ X4))|~((epred1_0 @ X4 @ (esk3_0 @ X4))))), inference(split_conjunct,[status(thm)],[c_0_2])). 23.48/3.40 thf(c_0_15, negated_conjecture, (epred1_0 @ (esk3_0 @ (esk1_0 @ (^[Z0:a]:((epred1_0 @ Z0 @ (esk3_0 @ Z0)))))) @ (esk1_0 @ (^[Z0:a]:((epred1_0 @ Z0 @ (esk3_0 @ Z0)))))), inference(spm,[status(thm)],[c_0_12, c_0_13])). 23.48/3.40 thf(c_0_16, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14, c_0_15]), c_0_13])]), ['proof']). 23.48/3.40 # SZS output end CNFRefutation 23.48/3.40 # Parsed axioms : 2 23.48/3.40 # Removed by relevancy pruning/SinE : 1 23.48/3.40 # Initial clauses : 6 23.48/3.40 # Removed in clause preprocessing : 0 23.48/3.40 # Initial clauses in saturation : 6 23.48/3.40 # Processed clauses : 878 23.48/3.40 # ...of these trivial : 170 23.48/3.40 # ...subsumed : 209 23.48/3.40 # ...remaining for further processing : 499 23.48/3.40 # Other redundant clauses eliminated : 0 23.48/3.40 # Clauses deleted for lack of memory : 0 23.48/3.40 # Backward-subsumed : 41 23.48/3.40 # Backward-rewritten : 58 23.48/3.40 # Generated clauses : 50845 23.48/3.40 # ...of the previous two non-redundant : 46357 23.48/3.40 # ...aggressively subsumed : 0 23.48/3.40 # Contextual simplify-reflections : 1 23.48/3.40 # Paramodulations : 50682 23.48/3.40 # Factorizations : 162 23.48/3.40 # NegExts : 0 23.48/3.40 # Equation resolutions : 1 23.48/3.40 # Propositional unsat checks : 0 23.48/3.40 # Propositional check models : 0 23.48/3.40 # Propositional check unsatisfiable : 0 23.48/3.40 # Propositional clauses : 0 23.48/3.40 # Propositional clauses after purity: 0 23.48/3.40 # Propositional unsat core size : 0 23.48/3.40 # Propositional preprocessing time : 0.000 23.48/3.40 # Propositional encoding time : 0.000 23.48/3.40 # Propositional solver time : 0.000 23.48/3.40 # Success case prop preproc time : 0.000 23.48/3.40 # Success case prop encoding time : 0.000 23.48/3.40 # Success case prop solver time : 0.000 23.48/3.40 # Current number of processed clauses : 394 23.48/3.40 # Positive orientable unit clauses : 73 23.48/3.40 # Positive unorientable unit clauses: 0 23.48/3.40 # Negative unit clauses : 14 23.48/3.40 # Non-unit-clauses : 307 23.48/3.40 # Current number of unprocessed clauses: 45044 23.48/3.40 # ...number of literals in the above : 140874 23.48/3.40 # Current number of archived formulas : 0 23.48/3.40 # Current number of archived clauses : 105 23.48/3.40 # Clause-clause subsumption calls (NU) : 12683 23.48/3.40 # Rec. Clause-clause subsumption calls : 10842 23.48/3.40 # Non-unit clause-clause subsumptions : 239 23.48/3.40 # Unit Clause-clause subsumption calls : 2110 23.48/3.40 # Rewrite failures with RHS unbound : 0 23.48/3.40 # BW rewrite match attempts : 1970 23.48/3.40 # BW rewrite match successes : 62 23.48/3.40 # Condensation attempts : 878 23.48/3.40 # Condensation successes : 4 23.48/3.40 # Termbank termtop insertions : 11938023 23.48/3.40 23.48/3.40 # ------------------------------------------------- 23.48/3.40 # User time : 2.819 s 23.48/3.40 # System time : 0.114 s 23.48/3.40 # Total time : 2.933 s 23.48/3.40 # Maximum resident set size: 1752 pages 23.48/3.43 EOF